online scheduling of jobs for d-benevolent instances on identical machines
Authors
abstract
we consider online scheduling of jobs with speci c release time on m identical machines. each job has a weight and a size; the goal is maximizing total weight of completed jobs. at release time of a job it must immediately be scheduled on a machine or it will be rejected. it is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contribute on pro t of the algorithm. in this paper we study d-benevolent instances which is a wide and standard class and we give a new algorithm, that admits (2m + 4)-competitive ratio. it is almost half of the previous known upper bound for this problem.
similar resources
Online Scheduling of Jobs for D-benevolent instances On Identical Machines
We consider online scheduling of jobs with specic release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contri...
full textOnline scheduling of two type parallel jobs on identical machines
In this paper we consider an online scheduling of parallel jobs with preemption on identical machines, where jobs arrive over time. The objective is to minimize the makespan. For the problem that jobs have only two possible widths mj = 1 or m, we present an optimal online algorithm by using " temporary schedule " .
full textScheduling equal-length jobs on identical parallel machines
We study the situation where a set of n jobs with release dates and equal processing times have to be scheduled on m identical parallel machines. We show that, if the objective function can be expressed as the sum of n functions fi of the completion time Ci of each job Ji, the problem can be solved in polynomial time for any fixed value of m. The only restriction is that functions fi have to be...
full textSemi-online scheduling jobs with tightly-grouped processing times on three identical machines
This paper investigates the semi-online version of scheduling problemP ||Cmax on a three-machine system.We assume that all jobs have their processing times between p and rp (p> 0, r 1).We give a comprehensive competitive ratio of LS algorithm which is a piecewise function on r 1. It shows that LS is an optimal semi-online algorithm for every r ∈ [1, 1.5], [√3, 2] and [6,+∞).We further present a...
full textOnline Makespan Scheduling of Linear Deteriorating Jobs on Parallel Machines
Traditional scheduling assumes that the processing time of a job is fixed. Yet there are numerous situations that the processing time increases (deteriorates) as the start time increases. Examples include scheduling cleaning or maintenance, fire fighting, steel production and financial management. Scheduling of deteriorating jobs was first introduced on a single machine by Browne and Yechiali, ...
full textOnline Scheduling of Equal-Length Jobs on Parallel Machines
We study on-line scheduling of equal-length jobs on parallel machines. Our main result is an algorithm with competitive ratio decreasing to e/(e − 1) ≈ 1.58 as the number of machine increases. For m ≥ 3, this is the first algorithm better than 2-competitive greedy algo-
full textMy Resources
Save resource for easier access later
Journal title:
journal of algorithms and computationجلد ۴۷، شماره ۱، صفحات ۲۷-۳۶
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023